Amalgamation of Transition Sequences in the PEPA Formalism
نویسندگان
چکیده
This report presents a formal approach to reducing sequences in PEPA components. Performing the described amalgamation procedure we may remove, from the underlying Markov chain, those states for which local detailed balance equations cannot be formulated. This transformation may lead to a simpler model with product form solution. Some classes of reduced models preserve those performance measures which we are interested in and, moreover, the steady state solution is much easier computationally.
منابع مشابه
PEPA Nets: A Structured Performance Modelling Formalism
In this paper we describe a formalism which uses the stochastic process algebra PEPA as the inscription language for labelled stochastic Petri nets. Viewed in another way, the net is used to provide a structure for combining related PEPA systems. The combined modelling language naturally represents such applications as mobile code systems where the PEPA terms are used to model the program code ...
متن کامل8 th Workshop on Process Algebra and Stochastically Timed Activities PASTA 2009
Discreteness and continuity are two opposite ways of describing the world. However, there are many situations, from engines to cells, in which an hybrid description, mixing both such ingredients, seems more adequate. In this presentation, we focus on stochastic hybrid systems. We present Piecewise Deterministic Markov Processes, and we provide a simpler description language, Transition-Driven S...
متن کاملPerformance Modelling of Hierarchical Networks using PEPA
We present a performance evaluation study of hierarchical cellular networks using PEPA. These networks constitute a new application area for this process algebra formalism. We show that this formalism can easly be used to model such systems. We also show that the strong equivalence ag-gregation technique behind PEPA allows a signiicant reduction of the state space of the underlying Markov proce...
متن کاملA Continuous State Space Approximation for PEPA Queues
PEPA Queues is a formalism that augments queueing networks with customers that have behavioural characteristics, as defined by PEPA components. PEPA Queues suffer from the traditional state-space explosion that affects both closed queueing networks and PEPA models. We discuss a possible solution to this with a continuous state-space approximation that allows us to derive an underlying mathemati...
متن کاملPEPA Nets
In this chapter we describe a formalism which uses the stochastic process algebra PEPA as the inscription language for labelled stochastic Petri nets. Viewed in another way, the net is used to provide a structure for linking related PEPA systems. The combined modelling language naturally represents such applications as mobile code systems where the PEPA terms are used to model the program code ...
متن کامل